Maximizing job benefits on multiprocessor systems using a greedy algorithm
نویسندگان
چکیده
منابع مشابه
Greedy multiprocessor server scheduling
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the `p norms of weighted flow time onm identical machines. Similar results for minimizing unweighted flow provide insight into the power of migration.
متن کاملAn unfair semi-greedy real-time multiprocessor scheduling algorithm
Most real-time multiprocessor scheduling algorithms for achieving optimal processor utilization, adhere to the fairness rule. Accordingly, tasks are executed in proportion to their utilizations at each time quantum or at the end of each time slice in a fluid schedule model. Obeying the fairness rule results in a large number of scheduling overheads, which affect the practicality of the algorith...
متن کاملOn Maximizing the Throughput of Multiprocessor Tasks
We consider the problem of scheduling n independent multiprocessor tasks with due dates and unit processing times, where the objective is to compute a schedule minimizing the throughput. We derive the complexity results and present several approximation algorithms. For the parallel variant of the problem, we introduce the first-fit increasing algorithm and the latest first increasing algorithm,...
متن کاملAn Greedy-Based Job Scheduling Algorithm in Cloud Computing
Nowadays/cloud computing has become a popular platform for scientific applications. Cloud computing intends to share a large number of resources such as equipments for storage and computation, and information and knowledge for scientific researches. Job scheduling algorithm is one of the most challenging theoretical issues in the cloud computing area. How to use cloud computing resources effici...
متن کاملMaximizing Job Completions Online
We consider the problem of maximizing the number of jobs completed by their deadline in an online single processor system where the jobs are preemptable and have release times. So in the standard three eld scheduling notation, this is the online version of the problem 1 j r i ; pmtn j P (1 ? U i). We present a deterministic algorithm Lax, and show that for every instance I, it is the case that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGBED Review
سال: 2008
ISSN: 1551-3688,1551-3688
DOI: 10.1145/1399583.1399586